Eulerian walk

См. также в других словарях:

• Eulerian path — In graph theory, an Eulerian path is a path in a graph which visits each edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the …   Wikipedia

• Seven Bridges of Königsberg — The Seven Bridges of Königsberg is a famous historical problem in mathematics. Its 1736 negative resolution by Leonhard Euler laid the foundations of graph theory and presaged the idea of topology. Description The city of Königsberg in Prussia… …   Wikipedia

• Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

• Route inspection problem — In graph theory, a branch of mathematics, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph. When the graph has an… …   Wikipedia

• combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

• Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

• Air pollution dispersion terminology — describes the words and technical terms that have a special meaning to those who work in the field of air pollution dispersion modeling. Governmental environmental protection agencies (local, state, province and national) of many countries have… …   Wikipedia

• Theoretical ecology — Mathematical models developed in theoretical ecology predict complex food webs are less stable than simple webs.[1]:75–77[2]:64 …   Wikipedia

• Königsberg bridge problem — a mathematical problem in graph theory, solved by Leonhard Euler, to show that it is impossible to cross all seven bridges of the Prussian city of Königsberg in a continuous path without recrossing any bridge. * * * ▪ mathematics  a recreational… …   Universalium

• List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

• List of mathematics articles (E) — NOTOC E E₇ E (mathematical constant) E function E₈ lattice E₈ manifold E∞ operad E7½ E8 investigation tool Earley parser Early stopping Earnshaw s theorem Earth mover s distance East Journal on Approximations Eastern Arabic numerals Easton s… …   Wikipedia